Digital Access to Comparison-Based Tree Data Structures and Algorithms
نویسندگان
چکیده
منابع مشابه
Digital Access to Comparison-Based Tree Data Structures and Algorithms
This paper presents a simple method to build tree data structures which achieve just O(log N) visited nodes and O(D) compared digits (bits or bytes) per search or update, where N is the number of keys and D is the length of the keys, irrespectively of the order of the updates and of the digital representation of the keys. The additional space required by the method is asymptotically dismissable...
متن کاملForest Stand Types Classification Using Tree-Based Algorithms and SPOT-HRG Data
Forest types mapping, is one of the most necessary elements in the forest management and silviculture treatments. Traditional methods such as field surveys are almost time-consuming and cost-intensive. Improvements in remote sensing data sources and classification –estimation methods are preparing new opportunities for obtaining more accurate forest biophysical attributes maps. This research co...
متن کاملUsing Data Mining and Three Decision Tree Algorithms to Optimize the Repair and Maintenance Process
The purpose of this research is to predict the failure of devices using a data mining tool. For this purpose, at the outset, an appropriate database consists of 392 records of ongoing failures in a pharmaceutical company in 1394, in the next step, by analyzing 9 characteristics and type of failure as a database class, analyzes have been used. In this regard, three decision tree algorithms have ...
متن کاملComparison of Advance Tree Data Structures
B-tree and R-tree are two basic index structures; many different variants of them are proposed after them. Different variants are used in specific application for the performance optimization. In this paper different variants of B-tree and R-tree are discussed and compared. Index structures are different in terms of structure, query support, data type support and application. Index structure&ap...
متن کاملTree-Based Mapping of Algorithms to Prede ned Structures
Due to the need for fast design cycles and low production cost, programmable targets like DSP processors are becoming increasingly popular. Design planning, detailed design as well as updating such designs requires mapping existing algorithms onto these targets. Instead of writing target-speci c mappers, we propose using retargetable mappers. The technique reported in this paper is based on pat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 2001
ISSN: 0196-6774
DOI: 10.1006/jagm.2001.1160